On the Group of Alternating Colored Permutations
نویسندگان
چکیده
منابع مشابه
On the Group of Alternating Colored Permutations
The group of alternating colored permutations is the natural analogue of the classical alternating group, inside the wreath product Zr ≀Sn. We present a ‘Coxeterlike’ presentation for this group and compute the length function with respect to that presentation. Then, we present this group as a covering of Z r 2 ≀ Sn and use this point of view to give another expression for the length function. ...
متن کاملCombinatorial study on the group of parity alternating permutations
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian numbers have intimate relationships to the set.
متن کاملOn the Excedance Sets of Colored Permutations
We define the excedence set and the excedance word on Gr,n, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.
متن کاملCombinatorics in the group of parity alternating permutations
We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...
متن کاملOn pattern avoiding alternating permutations
An alternating permutation of length n is a permutation π = π1π2 · · ·πn such that π1 < π2 > π3 < π4 > · · · . Let An denote the set of alternating permutations of {1, 2, . . . , n}, and let An(σ) be the set of alternating permutations in An that avoid a pattern σ. Recently, Lewis used generating trees to enumerate A2n(1234), A2n(2143) and A2n+1(2143), and he posed some conjectures on the Wilf-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3974